Pii: S0010-4485(98)00019-0
نویسنده
چکیده
A new approach is described which provides deformation methods for multi-patch tensor based free-form surfaces. The surface deformation generated is controlled by global geometric constraints. For example, the objective can be to deform a free-form surface until it becomes tangent to a pre-defined plane at a given point. This point can be fixed or free to slide on the surface. The parametric deformation of surfaces is dedicated to modifications of free-form surfaces within CAD software and to the design of objects submitted to aesthetic requirements. It is an alternative to previous approaches and it works with multiple surfaces through a simple mechanical model. The deformation method uses an analogy between the control polyhedron of each surface (based on a B-Spline model) and the mechanical equilibrium of a rigid bar network. The user can localize the surface deformation into an arbitrary shaped area through the selection of control polyhedron vertices spread over the entire surface. These vertices are used to automatically construct the associated bar network. The bar network equilibrium parameters are set up to achieve isotropic or anisotropic deformation as required by the designer. The surface deformation is then automatically carried through an optimization process which modifies mechanical parameters to agree with the global geometric constraint set up. The G continuity across the different during the deformation process using a set of geometric constraints in addition to mechanical ones. Parametric free-form surface deformation can be subjected to non-linear geometric constraints such as the tangency of a surface to a pre-defined plane. The resolution of such a problem uses an optimization process which minimizes the variation of the parameters governing the equilibrium of the bar network, namely the external forces applied to the nodes of the network. Several examples illustrate basic deformation types with various sets of constraints. q 1998 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Bisector curves of planar rational curves
This paper presents a simple and robust method for computing the bisector of two planar rational curves. We represent the correspondence between the foot points on two planar rational curves C1(t) and C2(r) as an implicit curve F(t; r) = 0, where F(t; r) is a bivariate polynomial B-spline function. Given two rational curves of degree m in the xy-plane, the curve F(t; r) = 0 has degree 4m 2, whi...
متن کاملPii: S0010-4485(98)00065-7
This paper presents a simple and robust method for computing the bisector of two planar rational curves. We represent the correspondence between the foot points on two planar rational curves C1ðtÞ and C2ðrÞ as an implicit curve F(t,r) 1⁄4 0, where F(t,r) is a bivariate polynomial B-spline function. Given two rational curves of degree m in the xy-plane, the curve F(t,r) 1⁄4 0 has degree 4m 1 2, ...
متن کاملPii: S0010-4485(98)00078-5
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set finding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. Each connected component of the surface intersection curve corresponds to a connected component ...
متن کاملApproximation of developable surfaces with cone spline surfaces
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit representations. Bending sequences and the development can be explicitly computed and the offsets are of the same type. The algorithms are based on elementary analytic and constructive geometry. There appear interesti...
متن کاملGeometric detail suppression by the Fourier transform
As the Finite Element Method is widely used in strength analysis, automatic mesh generation draws more attention these days. For a given geometric tolerance value, the purpose of mesh generators is to discretize the continuous model within this error limit. Faithfulness to this condition produces many small elements at small features. Often, these regions are of little interest and computer res...
متن کاملThe intersection of two ruled surfaces
This paper presents an eecient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set nding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. Each connected component of the surface intersection curve corresponds to a connected component in the...
متن کامل